On sequential traversal of sets
نویسندگان
چکیده
The problem of sequential traversal megapolises with precedence conditions is investigated; this oriented to mechanical engineering — CNC metal cutting machines. There the following setting singularity: terminal component additive criterion contains dependence on starting point. This singularity leads fact that natural solution procedure based dynamic programming must be applied individually for every investigation goal consists in construction an optimizing algorithm determining a complex including route (a variant megapolis numbering), trajectory, and proposed realizes idea directed enumeration points. realized as program PC; computations model examples are made.
منابع مشابه
Efficient Sequential ATPG Based on Partitioned Finite-State-Machine Traversal
We present a new automatic test pattern generation algorithm for sequential circuits by traversing the partitioned state spaces. The new features include: (1) nondisjoint state groups are obtained such that two different state groups may have common flip-flops, (2) partial state transition graphs (STGs) are constructed at run time for each state group, (3) spectral information for state variabl...
متن کاملSequential Equivalence Checking without State Space Traversal
Because general algorithms for sequential equivalence checking require a state space traversal of the product machine, they are computationally expensive. In this paper, we present a new method for sequential equivalence checking which utilizes functionally equivalent signals to prove the equivalence of both circuits, thereby avoiding the state space traversal. The effectiveness of the proposed...
متن کاملSequential Sets
Let ∆∞ = End([∞]) be the monoid of convergent monotonic sequences in N∪{∞}. The category Pre(∆∞) of sequential sets is the category whose objects are sets equipped with an action of this monoid, and whose morphisms are equivariant maps. We call a category C sequentially generated if it is a localization of Pre(∆∞). In this paper we show that several important categories, including the category ...
متن کاملSequential Classification on Partially Ordered Sets
A general theorem on asymptotically optimal sequential selection of experiments is presented and applied to a Bayesian classification problem when the parameter space is a finite partially ordered set. The main results include establishing conditions under which the posterior probability of the true state converges to one almost surely, and determining optimal rates of convergence. Properties o...
متن کاملOn Sequential Coloring of Graphs and Its Defining Sets
In this paper, based on the contributions of Tucker (1983) and Sebő (1992), we generalize the concept of a sequential coloring of a graph to a framework in which the algorithm may use a coloring rule-base obtained from suitable forcing structures. In this regard, we introduce the weak and strong sequential defining numbers for such colorings and as the main results, after proving some basic pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vestnik Udmurtskogo universiteta
سال: 2021
ISSN: ['1994-9197', '2076-5959']
DOI: https://doi.org/10.35634/vm210310